Optimal Matroid Partitioning Problems
نویسندگان
چکیده
This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given k weighted-matroids on same ground set. Our goal is to find a feasible partition that minimizes (maximizes) value of an function. A typical maximum over all subsets total weights elements in subset, which extensively studied scheduling literature. Likewise, as function, handle maximum/minimum/sum maximum/minimum/total weight(s) subset. this paper, determine computational complexity problem with above-described Namely, each either provide polynomial time algorithm or prove NP-hardness. We also discuss approximability NP-hard cases.
منابع مشابه
Optimal Matroid Partitioning Problems
This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given a finite set E and k weighted matroids (E, Ii, wi), i = 1, . . . , k, and our task is to find a minimum partition (I1, . . . , Ik) of E such that Ii ∈ Ii for all i. For each objective function, we give a polynomial-time algorithm or prove NP-hardness. In particular, for the cas...
متن کاملMatroid Secretary Problems
In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candi...
متن کاملParallel Complexity for Matroid Intersection and Matroid Parity Problems
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid parity set) is called a basic matroid intersection (basic matroid parity set), if its size is the rank of the matroid. We present that enumerating all basic matroid intersections (basic matroid parity sets) is in NC, provided that there are polynomial bounded basic m...
متن کاملA Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomialtime algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity point of view: instead of the trivial O(n) time brute force algorithm for finding a k-element sol...
متن کاملOn the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ 2 . In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be Σ 2 -complete and is coNPhard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-021-00797-9